Termination w.r.t. Q of the following Term Rewriting System could be proven:

Q restricted rewrite system:
The TRS R consists of the following rules:

app(app(map, f), nil) → nil
app(app(map, f), app(app(cons, x), xs)) → app(app(cons, app(f, x)), app(app(map, f), xs))
app(app(treemap, f), app(app(node, x), xs)) → app(app(node, app(f, x)), app(app(map, app(treemap, f)), xs))

Q is empty.


QTRS
  ↳ Overlay + Local Confluence

Q restricted rewrite system:
The TRS R consists of the following rules:

app(app(map, f), nil) → nil
app(app(map, f), app(app(cons, x), xs)) → app(app(cons, app(f, x)), app(app(map, f), xs))
app(app(treemap, f), app(app(node, x), xs)) → app(app(node, app(f, x)), app(app(map, app(treemap, f)), xs))

Q is empty.

The TRS is overlay and locally confluent. By [15] we can switch to innermost.

↳ QTRS
  ↳ Overlay + Local Confluence
QTRS
      ↳ DependencyPairsProof

Q restricted rewrite system:
The TRS R consists of the following rules:

app(app(map, f), nil) → nil
app(app(map, f), app(app(cons, x), xs)) → app(app(cons, app(f, x)), app(app(map, f), xs))
app(app(treemap, f), app(app(node, x), xs)) → app(app(node, app(f, x)), app(app(map, app(treemap, f)), xs))

The set Q consists of the following terms:

app(app(map, x0), nil)
app(app(map, x0), app(app(cons, x1), x2))
app(app(treemap, x0), app(app(node, x1), x2))


Using Dependency Pairs [1,13] we result in the following initial DP problem:
Q DP problem:
The TRS P consists of the following rules:

APP(app(treemap, f), app(app(node, x), xs)) → APP(map, app(treemap, f))
APP(app(map, f), app(app(cons, x), xs)) → APP(app(cons, app(f, x)), app(app(map, f), xs))
APP(app(treemap, f), app(app(node, x), xs)) → APP(app(node, app(f, x)), app(app(map, app(treemap, f)), xs))
APP(app(map, f), app(app(cons, x), xs)) → APP(f, x)
APP(app(treemap, f), app(app(node, x), xs)) → APP(f, x)
APP(app(treemap, f), app(app(node, x), xs)) → APP(node, app(f, x))
APP(app(map, f), app(app(cons, x), xs)) → APP(app(map, f), xs)
APP(app(map, f), app(app(cons, x), xs)) → APP(cons, app(f, x))
APP(app(treemap, f), app(app(node, x), xs)) → APP(app(map, app(treemap, f)), xs)

The TRS R consists of the following rules:

app(app(map, f), nil) → nil
app(app(map, f), app(app(cons, x), xs)) → app(app(cons, app(f, x)), app(app(map, f), xs))
app(app(treemap, f), app(app(node, x), xs)) → app(app(node, app(f, x)), app(app(map, app(treemap, f)), xs))

The set Q consists of the following terms:

app(app(map, x0), nil)
app(app(map, x0), app(app(cons, x1), x2))
app(app(treemap, x0), app(app(node, x1), x2))

We have to consider all minimal (P,Q,R)-chains.

↳ QTRS
  ↳ Overlay + Local Confluence
    ↳ QTRS
      ↳ DependencyPairsProof
QDP
          ↳ EdgeDeletionProof

Q DP problem:
The TRS P consists of the following rules:

APP(app(treemap, f), app(app(node, x), xs)) → APP(map, app(treemap, f))
APP(app(map, f), app(app(cons, x), xs)) → APP(app(cons, app(f, x)), app(app(map, f), xs))
APP(app(treemap, f), app(app(node, x), xs)) → APP(app(node, app(f, x)), app(app(map, app(treemap, f)), xs))
APP(app(map, f), app(app(cons, x), xs)) → APP(f, x)
APP(app(treemap, f), app(app(node, x), xs)) → APP(f, x)
APP(app(treemap, f), app(app(node, x), xs)) → APP(node, app(f, x))
APP(app(map, f), app(app(cons, x), xs)) → APP(app(map, f), xs)
APP(app(map, f), app(app(cons, x), xs)) → APP(cons, app(f, x))
APP(app(treemap, f), app(app(node, x), xs)) → APP(app(map, app(treemap, f)), xs)

The TRS R consists of the following rules:

app(app(map, f), nil) → nil
app(app(map, f), app(app(cons, x), xs)) → app(app(cons, app(f, x)), app(app(map, f), xs))
app(app(treemap, f), app(app(node, x), xs)) → app(app(node, app(f, x)), app(app(map, app(treemap, f)), xs))

The set Q consists of the following terms:

app(app(map, x0), nil)
app(app(map, x0), app(app(cons, x1), x2))
app(app(treemap, x0), app(app(node, x1), x2))

We have to consider all minimal (P,Q,R)-chains.
We deleted some edges using various graph approximations

↳ QTRS
  ↳ Overlay + Local Confluence
    ↳ QTRS
      ↳ DependencyPairsProof
        ↳ QDP
          ↳ EdgeDeletionProof
QDP
              ↳ DependencyGraphProof

Q DP problem:
The TRS P consists of the following rules:

APP(app(map, f), app(app(cons, x), xs)) → APP(app(cons, app(f, x)), app(app(map, f), xs))
APP(app(treemap, f), app(app(node, x), xs)) → APP(map, app(treemap, f))
APP(app(treemap, f), app(app(node, x), xs)) → APP(app(node, app(f, x)), app(app(map, app(treemap, f)), xs))
APP(app(map, f), app(app(cons, x), xs)) → APP(f, x)
APP(app(treemap, f), app(app(node, x), xs)) → APP(f, x)
APP(app(treemap, f), app(app(node, x), xs)) → APP(node, app(f, x))
APP(app(map, f), app(app(cons, x), xs)) → APP(app(map, f), xs)
APP(app(map, f), app(app(cons, x), xs)) → APP(cons, app(f, x))
APP(app(treemap, f), app(app(node, x), xs)) → APP(app(map, app(treemap, f)), xs)

The TRS R consists of the following rules:

app(app(map, f), nil) → nil
app(app(map, f), app(app(cons, x), xs)) → app(app(cons, app(f, x)), app(app(map, f), xs))
app(app(treemap, f), app(app(node, x), xs)) → app(app(node, app(f, x)), app(app(map, app(treemap, f)), xs))

The set Q consists of the following terms:

app(app(map, x0), nil)
app(app(map, x0), app(app(cons, x1), x2))
app(app(treemap, x0), app(app(node, x1), x2))

We have to consider all minimal (P,Q,R)-chains.
The approximation of the Dependency Graph [13,14,18] contains 1 SCC with 5 less nodes.

↳ QTRS
  ↳ Overlay + Local Confluence
    ↳ QTRS
      ↳ DependencyPairsProof
        ↳ QDP
          ↳ EdgeDeletionProof
            ↳ QDP
              ↳ DependencyGraphProof
QDP
                  ↳ QDPOrderProof

Q DP problem:
The TRS P consists of the following rules:

APP(app(map, f), app(app(cons, x), xs)) → APP(f, x)
APP(app(treemap, f), app(app(node, x), xs)) → APP(f, x)
APP(app(map, f), app(app(cons, x), xs)) → APP(app(map, f), xs)
APP(app(treemap, f), app(app(node, x), xs)) → APP(app(map, app(treemap, f)), xs)

The TRS R consists of the following rules:

app(app(map, f), nil) → nil
app(app(map, f), app(app(cons, x), xs)) → app(app(cons, app(f, x)), app(app(map, f), xs))
app(app(treemap, f), app(app(node, x), xs)) → app(app(node, app(f, x)), app(app(map, app(treemap, f)), xs))

The set Q consists of the following terms:

app(app(map, x0), nil)
app(app(map, x0), app(app(cons, x1), x2))
app(app(treemap, x0), app(app(node, x1), x2))

We have to consider all minimal (P,Q,R)-chains.
We use the reduction pair processor [13].


The following pairs can be oriented strictly and are deleted.


APP(app(map, f), app(app(cons, x), xs)) → APP(f, x)
APP(app(treemap, f), app(app(node, x), xs)) → APP(f, x)
APP(app(map, f), app(app(cons, x), xs)) → APP(app(map, f), xs)
APP(app(treemap, f), app(app(node, x), xs)) → APP(app(map, app(treemap, f)), xs)
The remaining pairs can at least be oriented weakly.
none
Used ordering: Combined order from the following AFS and order.
APP(x1, x2)  =  x2
app(x1, x2)  =  app(x1, x2)
map  =  map
cons  =  cons
treemap  =  treemap
node  =  node

Lexicographic path order with status [19].
Quasi-Precedence:
treemap > app2 > [map, cons, node]

Status:
treemap: multiset
map: multiset
app2: [2,1]
node: multiset
cons: multiset


The following usable rules [14] were oriented: none



↳ QTRS
  ↳ Overlay + Local Confluence
    ↳ QTRS
      ↳ DependencyPairsProof
        ↳ QDP
          ↳ EdgeDeletionProof
            ↳ QDP
              ↳ DependencyGraphProof
                ↳ QDP
                  ↳ QDPOrderProof
QDP
                      ↳ PisEmptyProof

Q DP problem:
P is empty.
The TRS R consists of the following rules:

app(app(map, f), nil) → nil
app(app(map, f), app(app(cons, x), xs)) → app(app(cons, app(f, x)), app(app(map, f), xs))
app(app(treemap, f), app(app(node, x), xs)) → app(app(node, app(f, x)), app(app(map, app(treemap, f)), xs))

The set Q consists of the following terms:

app(app(map, x0), nil)
app(app(map, x0), app(app(cons, x1), x2))
app(app(treemap, x0), app(app(node, x1), x2))

We have to consider all minimal (P,Q,R)-chains.
The TRS P is empty. Hence, there is no (P,Q,R) chain.